n,x,y = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(n):
take= True
for j in range(max(0,i-x),min(n-1,i+y)+1):
if i!=j and arr[i]>=arr[j]:
take = False
if take: print(i+1);break
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y;
cin>>n>>x>>y;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n;i++)
{
bool flag=false;
//left
for(int j=i-1;j>=i-x&&j>=0&&!flag;j--)
if(arr[j]<=arr[i])
flag=true;
if(flag)
continue;
//right
for(int j=i+1;j<n&&j<=i+y&&!flag;j++)
if(arr[j]<=arr[i])
flag=true;
if(!flag)
{
cout<<i+1;
return 0;
}
}
}881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |